Fractional illumination of convex bodies
نویسنده
چکیده
We introduce a fractional version of the illumination problem of Gohberg, Markus, Boltyanski and Hadwiger, according to which every convex body in R is illuminated by at most 2 directions. We say that a weighted set of points on Sd−1 illuminates a convex body K if for each boundary point of K, the total weight of those directions that illuminate K at that point is at least one. We define the fractional illumination number of K as the minimum total weight of a weighted set of points on Sd−1 that illuminates K. We prove that the fractional illumination number of any o-symmetric convex body is at most 2, and of a general convex body ` 2d d ́ . As a corollary, we obtain that for any o-symmetric convex polytope with k vertices, there is a direction that illuminates at least ̊ k 2d ˇ vertices. 1. Definitions and Results We work in the d–dimensional Euclidean space Rd, denote the origin by o and the unit sphere by Sd−1. The cardinality, interior, boundary and the volume of a set X ⊂ Rd are denoted by cardX, intX,bdX and volX, respectively. We say that a direction u ∈ Sd−1 illuminates a boundary point x of the convex body K if the ray emanating from x in the direction u intersects the interior of K. A set of directions A ⊆ Sd−1 illuminates K if each boundary point of K is illuminated by at least one member of A. The illumination number i(K) of K is the minimum number of directions that illuminate K. The following was conjectured by I. Gohberg, A. S. Markus, V. G. Boltyanski and H. Hadwiger: Every convex body in Rd is illuminated by at most 2d directions (that is, i(K) ≤ 2d) moreover, parallelotopes are the only bodies requiring 2d directions. For a thorough treatment of the development of this and related problems, see [4, 11, 14]. In this note, we introduce the following fractional version of the illumination number. Received by the editors January 14, 2009, and in revised form June 9, 2009. 2000 Mathematics Subject Classification. 52C17, 52A35, 52C45.
منابع مشابه
Survey Paper Combinatorial problems on the illumination of convex bodies
This is a review of various problems and results on the illumination of convex bodies in the spirit of combinatorial geometry. The topics under review are: history of the Gohberg–Markus–Hadwiger problem on the minimum number of exterior sources illuminating a convex body, including the discussion of its equivalent forms like the minimum number of homothetic copies covering the body; generalizat...
متن کاملOn the successive illumination parameters of convex bodies
The notion of successive illumination parameters of convex bodies is introduced. We prove some theorems in the plane and determine the exact values of the successive illumination parameters of spheres, cubes and crosspolytopes for some dimensions.
متن کاملA generalized form of the Hermite-Hadamard-Fejer type inequalities involving fractional integral for co-ordinated convex functions
Recently, a general class of the Hermit--Hadamard-Fejer inequality on convex functions is studied in [H. Budak, March 2019, 74:29, textit{Results in Mathematics}]. In this paper, we establish a generalization of Hermit--Hadamard--Fejer inequality for fractional integral based on co-ordinated convex functions.Our results generalize and improve several inequalities obtained in earlier studies.
متن کاملInequalities for mixed p - affine surface area ∗
We prove new Alexandrov-Fenchel type inequalities and new affine isoperimetric inequalities for mixed p-affine surface areas. We introduce a new class of bodies, the illumination surface bodies, and establish some of their properties. We show, for instance, that they are not necessarily convex. We give geometric interpretations of Lp affine surface areas, mixed p-affine surface areas and other ...
متن کاملOptimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions
In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Contributions to Discrete Mathematics
دوره 4 شماره
صفحات -
تاریخ انتشار 2009